trait solver: Capture binder region constraints while relating - #157984
trait solver: Capture binder region constraints while relating#157984Dnreikronos wants to merge 17 commits into
Conversation
|
r? @mejrs rustbot has assigned @mejrs. Use Why was this reviewer chosen?The reviewer was selected based on:
|
This comment has been minimized.
This comment has been minimized.
f411fec to
d78cef7
Compare
|
r? @lcnr |
|
r? BoxyUwU |
|
|
This comment has been minimized.
This comment has been minimized.
|
@BoxyUwU fwiw, i think the ci failure is still compatible with your suggestion. the direct registration path lgtm to me, but the current version is probably registering from too many relation contexts. the bad bit seems to be solverrelating::regions(): under -zassumptions-on-binders it always pushes regionoutlives into the solver constraint storage. some of those relation calls happen under enter_forall_with_empty_assumptions, so later placeholder handling has no assumptions to discharge the constraint and we hit the max_universe(...) < u assert. imo the fix is not to go back to manually bubbling a list everywhere. i'd rather keep direct registration, but only in contexts where the solver owns the binder assumptions, or keep the constraints local while relating a binder and pull them out before registering. idk which shape is cleaner yet, but unconditional registration in regions() seems too wide. |
|
follow-up after pushing 0d93b4c: i tried to keep the direct-registration shape, but idk, it still looked too broad in practice. buffering constraints around binder relation did not clear the reported failures for me. imo the safer fix is to keep the region constraints local while relating, then register the collected next-gen constraint only from the solver-owned relation entrypoints. ltm this still follows the direction boxy was pointing at, without letting solverrelating::regions() register constraints from the empty-assumption binder probes. i checked the same failure cases locally:
|
in theory that shouldn't cause us to hit an assert. if we have empty assumptions then we'll rewrite the constraints to i would like to fully understand what's going on with the ICEs when always registering the next gen region constraints :3 can you look more into what's going on there, if you could push the code that causes those ICEs to happen so I can see the CI failure too that would be useful :3 |
|
i looked into the unconditional direct-registration version locally. imo it confirms the failure mode from my earlier guess: the new repro tests pass, but the broader assumptions-on-binders set fails. specifically:
so idk, direct registration from i can push the failing experiment to a separate branch if seeing ci on that exact shape would help, but i'd rather not force-push it over this pr branch since the current version is passing. checked with:
|
|
like I said, I don't understand why it's hitting that assertion 😅 can you explain why that assertion is getting hit. i can't properly evaluate this alternate approach without understanding why the other one doesn't work |
This comment has been minimized.
This comment has been minimized.
|
yeah, my bad! i think i explained the empty-assumptions bit too confidently there. i pushed the direct registration version again so ci can show the actual failure: 31be28b idk yet why it ends up at the |
This comment has been minimized.
This comment has been minimized.
31be28b to
0837d0c
Compare
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
This comment has been minimized.
0837d0c to
83c5653
Compare
This comment has been minimized.
This comment has been minimized.
|
@rustbot author gonna do that while you figure out what's going on there, if you're having trouble we can chat about it over zulip and try figure it out together |
This comment has been minimized.
This comment has been minimized.
|
This PR was rebased onto a different main commit. Here's a range-diff highlighting what actually changed. Rebasing is a normal part of keeping PRs up to date, so no action is needed—this note is just to help reviewers. |
This comment has been minimized.
This comment has been minimized.
Unknown or remaining must not drop the unknown sibling. A later-false candidate would otherwise become NoSolution.
5c6f4f2 to
62ca92b
Compare
|
Ok I've thought about this for a while and I think I know how I'd like to proceed. To start with I really don't feel confident that I understand the reason why we need this normalization step for turning region vars into placeholders they're known to be equal to. I also think that getting to the point where I am confident I understand it is going to take a while (and already we've spent a bunch of time on this). But, the core thing this PR is doing is also clearly correct, we definitely want to actually register region constraints when we do type relations 😅 I think what I'd like to do is (unordered list):
This of course is all assuming that the breakage here is just that one I'm also realising that even if the normalization step is necessary (which I can imagine being the case fwiw), I wouldn't want to land it as part of this PR 🤔 So I think the above steps are probably the right way to go about this regardless so that we get things happening in incremental steps and you can finally get this PR merged 😅 |
|
@rustbot author |
View all comments
Fixes #157859
The issue repro is a pretty good example of how this slipped through: the principal upcast path looked fixed, but other relation paths could still drop binder-region constraints. Fwiw, I think centralizing this in the relation code is the cleaner move here, instead of chasing every object-upcast call site one by one.
This records NextGen region constraints from normal relation, structural alias equality, and the small goal-returning relation helper used by object candidate code. ReVars keep their concrete outlives edges too, so we don't flatten useful info into plain ambiguity. Added the original issue repro and a projection-bound variant, e.g. the kind of path I'd expect to regress later if this only lived in the principal upcast code.